Chris Pollett > Old Classes >
CS154
( Print View )

Student Corner:
  [Grades Sec3]

  [Submit Sec3]

  [Class Sign up Sec3]

  [Lecture Notes]

  [Discussion Board]

  [Announcements]

Course Info:
  [Texts & Links]
  [Topics/Outcomes]
  [Outcomes Matrix]
  [Grading]
  [HW Info]
  [Exam Info]
  [Regrades]
  [Honesty]
  [Additional Policies]

HW Assignments:
  [Hw1] [Hw2] [Hw3]
  [Hw4] [Hw5]

Practice Exams:
  [Mid1] [Mid2] [Final]

HW#4 --- last modified February 28 2019 23:10:35..

Solution set.

Due date: Apr 16

Files to be submitted:
Hw4.pdf

Purpose: To become more familiar with Context Free Grammars, PDAs, DPDAs and conversions between them.

Related Course Outcomes:

(1) Write a grammar for a language described otherwise.

(2) Construct deterministic and non-deterministic machines for various languages.

(7) Be able to use a pumping lemma to show that some languages are not regular and/or not context-free Use closure properties to simplify proofs of non-regularity of languages.

(8) Be able to construct a pushdown automaton accepting a given language.

Specification:

Do problems: p183 #4b,c,e,f, p195 #5, #15, p212 #8 d-g, p220 #12 out of the book and sumbit these as Hw4.pdf.

Point Breakdown

Each Book problem (2pts each)	10pts
Total	10pts